Using an imperfect photonic network to implement random unitaries

Random Unitaries Give Quantum Expanders

How to Implement a Random Bisection Cut

By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether ...

Using mobile agents to implement flexible network management strategies

Due to their intrinsic complexity, computer and communication systems require increasingly more sophisticated management starategies to be adopted in order to guarantee adequate levels of performance and reliability. The centralized paradigm adopted by the SNMP is appropriate in several network management applications, but the quick expansion of networks has posed the problem of its scalability...

Using Dynamic Aspect-Oriented Programming to Implement an Autonomic System

As computational complexity of systems continues to increase, the amount of maintenance required to keep them operational will also increase. Autonomic systems have the aim of reducing the amount of maintenance required by performing certain levels of maintenance themselves. This paper outlines the case of using dynamic AOP to implement such a system. The benefits and issues arising from using ...

Random unitaries in non-commutative tori, and an asymptotic model for q-circular systems

We consider the concept of q-circular system, which is a deformation of the circular system from free probability, taking place in the framework of the so-called “qcommutation relations”. We show that certain averages of random unitaries in noncommutative tori behave asymptotically like a q-circular system. More precisely: let q be in (−1, 1); let s, k be positive integers; let (ρij)1≤i<j≤ks be...